Morse glasses: an IoT communication system based on Morse code for users with speech impairments
نویسندگان
چکیده
The advent of internet things has opened the opportunities for people with disabilities, increased their inclusion and productivity in living society. Most invented smart sensing devices including wearable ones users speech impairments are expensive not affordable patients low income countries such as Egypt. Morse Glasses is a cost efficient device based on IoT technology modified code that tracks patient’s eyes blinks translates it into generated speech. A sequence encoded alphabets/sentences along frequently used displayed heard any android supported installed mobile application. With less than 30$, motor neuron diseases Amyotrophic Lateral Sclerosis (ALS) can communicate easily others, express needs simply live life normally.
منابع مشابه
An Interactive Wireless Morse Code Learning System
Morse code has been shown to be a valuable tool in assistive technology, augmentative and alternative communication, and rehabilitation for some people with various conditions, such as spinal cord injuries, non-vocal quadriplegics, and visual or hearing impairments. In this article, a mobile phone human-interface system using Morse code input device is designed and implemented for the person wi...
متن کاملThe Tap code - a code similar to Morse code for communication by tapping
A code is presented for fast, easy and efficient communication over channels that allow only two signal types: a single sound (e.g. a knock), or no sound (i.e. silence). This is a true binary code while Morse code is a ternary code and does not work in such situations. Thus the presented code is more universal than Morse and can be used in much more situations. Additionally it is very tolerant ...
متن کاملSome Algebraic Aspects of Morse Code Sequences
1 Morse code polynomials Morse code sequences are finite sequences of dots (•) and dashes (−). If a dot has length 1 and a dash has length 2 then the number of all such sequences of total length n−1 is the Fibonacci number Fn, which is defined as the sequence of numbers satisfying the recursion Fn = Fn−1 + Fn−2 with initial conditions F0 = 0 and F1 = 1. If a dash is assumed to have length j, j≥...
متن کاملMorse Theory on Graphs
Let Γ be a finite d-valent graph and G an n-dimensional torus. An " action " of G on Γ is defined by a map which assigns to each oriented edge, e, of Γ, a one-dimensional representation of G (or, alternatively, a weight, αe, in the weight lattice of G. For the assignment, e → αe, to be a schematic description of a " G-action " , these weights have to satisfy certain compatibility conditions: th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 2021
ISSN: ['0010-485X', '1436-5057']
DOI: https://doi.org/10.1007/s00607-021-00959-1